Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows

نویسندگان

  • James MacGregor Smith
  • Wu-Ji Li
چکیده

| One of the most notorious network design problems is the Quadratic Assignment Problem (QAP). We develop an heuristic algorithm for QAPs along with an M/G/C/C state dependent queueing model for capturing congestion in the tra c system interconnecting the nodes in the network. Computational results are also presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

متن کامل

Modeling of Partial Digest Problem as a Network flows problem

Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...

متن کامل

ON AN EXTENSION OF A QUADRATIC TRANSFORMATION FORMULA DUE TO GAUSS

The aim of this research note is to prove the following new transformation formula begin{equation*} (1-x)^{-2a},_{3}F_{2}left[begin{array}{ccccc} a, & a+frac{1}{2}, & d+1 & & \ & & & ; & -frac{4x}{(1-x)^{2}} \ & c+1, & d & & end{array}right] \ =,_{4}F_{3}left[begin{array}{cccccc} 2a, & 2a-c, & a-A+1, & a+A+1 & & \ & & & & ; & -x \ & c+1, & a-A, & a+A & & end{array} right], end{equation*} wher...

متن کامل

A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem

A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems. In this paper, we describe a GRASP for the quadratic assignment problem. We review basic concepts of GRASP: construction and local search algorithms. The implementation of GRASP for the quadratic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Optim.

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2001